An Algorithm for Affine Approximation of Binary Decision Diagrams
نویسندگان
چکیده
This paper is concerned with the problem of Boolean approximation in the following sense: given a Boolean function class and an arbitrary Boolean function, what is the function’s best proxy in the class? Specifically, what is its strongest logical consequence (or envelope) in the class of affine Boolean functions. We prove various properties of affine Boolean functions and their representation as ROBDDs. Using these properties, we develop an ROBDD algorithm to find the affine envelope of a Boolean function.
منابع مشابه
Binary Decision Diagrams for Affine Approximation
Selman and Kautz’s work on “knowledge compilation” established how approximation (strengthening and/or weakening) of a propositional knowledge-base can be used to speed up query processing, at the expense of completeness. In this classical approach, querying uses Horn overand under-approximations of a given knowledge-base, which is represented as a propositional formula in conjunctive normal fo...
متن کاملBoolean Affine Approximation with Binary Decision Diagrams
Selman and Kautz’s work on knowledge compilation has established how approximation (strengthening and/or weakening) of a propositional knowledgebase can be used to speed up query processing, at the expense of completeness. In the classical approach, the knowledge-base is assumed to be presented as a propositional formula in conjunctive normal form (CNF), and Horn functions are used to overand u...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملApproximate Algorithms for Minimization of Binary Decision Diagrams on the Basis of Linear Transformations of Variables
Algorithms for an approximate minimization of binary decision diagrams (BDD) on the basis of linear transformations of variables are proposed. The algorithms rely on the transformations of only adjacent variables and have a polynomial complexity relative to the size of the table that lists values of the function involved.
متن کاملApproximability and Nonapproximability by Binary Decision Diagrams
The usual applications of BDDs (binary decision diagrams), e. g., in verification and for CAD problems, require an exact representation of the considered boolean functions. However, if BDDs are used for learning boolean functions f on the basis of classified examples (e. g., in the environment of genetic programming), it is sufficient to produce the representation of a function g approximating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010